Cheat-Proof Playout for Centralized and Serverless Online Games

نویسندگان

  • Nathaniel E. Baughman
  • Marc Liberatore
  • Brian Neil Levine
چکیده

We explore exploits possible for cheating in realtime, multiplayer games for both client-server and serverless architectures. We offer the first formalization of cheating in online games and propose an initial set of strong solutions. We propose a protocol that has provable anti-cheating guarantees, is provably safe and live, but suffers a performance penalty. We then develop an extended version of this protocol, called asynchronous synchronization, which avoids the penalty, is serverless, offers provable anticheating guarantees, is robust in the face of packet loss, and provides for significantly increased communication performance. This technique is applicable to common game features as well as clustering and cellbased techniques for massively multiplayer games. Specifically, we provide a zero-knowledge proof protocol so that players are within a specific range of each other, and otherwise have no notion of their distance. Our performance claims are backed by analysis using a simulation based on real game traces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cheat-proof Playout for Centralized and Distributed Online Games

We explore exploits possible for cheating in real-time, multiplayer games for both client-server and distributed, serverless architectures. We offer the first formalization of cheating in online games and propose an initial set of strong solutions. We propose a protocol that has provable anti-cheating guarantees, but suffers a performance penalty. We then develop an extended version of this pro...

متن کامل

Low-Latency and Cheat-proof Event Ordering for Distributed Games

In this paper, we describe a new protocol for ordering events in peer-to-peer games that is provably cheat-proof. We describe how we can optimize this protocol to react to changing delays and congestion in the network. We validate our protocol through simulations and demonstrate its feasibility as a real-time, interactive protocol. To our knowledge, this is the first peer-to-peer protocol that ...

متن کامل

A Peer Auditing Scheme for Cheat Detection in MMOGs

Although much of the research into massively multiplayer online games (MMOGs) focuses on scalability concerns, other issues such as the existence of cheating have an equally large practical impact on game success. Cheat prevention itself is usually addressed through the use of proprietary, ad-hoc or manual methods, combined with a strong centralized authority as found in a straightforward clien...

متن کامل

Playout Policy Adaptation for Games

Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). We propose to learn a playout policy online so as to improve MCTS for GGP. We test the resulting algorithm named Playout Policy Adaptation (PPA) on Atarigo, Breakthrough, Misere Breakthrough, Domineering, Misere Domineering, Go, Knightthrough, Misere Knightthrough, Nogo and Misere Nogo. For most of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004